On the approximation of Min Split-coloring and Min Cocoloring
نویسندگان
چکیده
منابع مشابه
On the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provide...
متن کاملComplexity and approximation results for the Min Weighted Coloring problem
A k-coloring of G = (V,E) is a partition S = (S1, . . . , Sk) of the node set V of G into stable sets Si (a stable set is a set of pairwise non adjacent nodes). In the usual case, the objective is to determine a node coloring minimizing k. A natural generalization of this problem is obtained by assigning a strictly positive integer weight w(v) for any node v ∈ V , and defining the weight of sta...
متن کاملApproximation of min coloring by moderately exponential algorithms
We present in this note a rather new way to cope with polynomial inapproximability of NP-hard problems. We study approximation of min coloring by moderately exponential time algorithms, able to achieve approximation ratios unachievable in polynomial time for min coloring by algorithms with provably upper complexity bounds, better than those of exact resolution.
متن کاملApproximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MIN-LIN2 and a MIN-BISECTION problem for graphs. MIN-LIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that sat-isses the minimum number of them. E3-OCC-MIN-E3-LIN2 is the bounded occurrence (degree) problem restricted as follows: each equation has ex...
متن کاملOn the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
GivenagraphG = (V,E) andk source-sinkpairs{(s1, t1), . . . , (sk, tk)} with each si, ti ∈ V , the Min-Sum Disjoint Paths problem asks k disjoint paths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also k disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2006
ISSN: 1526-1719
DOI: 10.7155/jgaa.00129